Equimorphism invariants for scattered linear orderings

نویسنده

  • ANTONIO MONTALBÁN
چکیده

Two linear ordering are equimorphic if they can be embedded in each other. We define invariants for scattered linear orderings which classify them up to equimorphism. Essentially, these invariants are finite sequences of finite trees with ordinal labels. Also, for each ordinal α, we explicitly describe the finite set of minimal scattered equimorphism types of Hausdorff rank α. We compute the invariants of each of these minimal types.

برای دانلود رایگان متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

On the Equimorphism Types of Linear Orderings

A linear ordering (also known as total ordering) embeds into another linear ordering if it is isomorphic to a subset of it. Two linear orderings are said to be equimorphic if they can be embedded in each other. This is an equivalence relation, and we call the equivalence classes equimorphism types. We analyze the structure of equimorphism types of linear orderings, which is partially ordered by...

متن کامل

Up to equimorphism, hyperarithmetic is recursive

Two linear orderings are equimorphic if each can be embedded into the other. We prove that every hyperarithmetic linear ordering is equimorphic to a recursive

متن کامل

A scattering of orders

A linear ordering is scattered if it does not contain a copy of the rationals. Hausdorff characterised the class of scattered linear orderings as the least family of linear orderings that includes the class B of well-orderings and reversed well-orderings, and is closed under lexicographic sums with index set in B. More generally, say that a partial ordering is κ-scattered if it does not contain...

متن کامل

Complementation of Rational Sets on Countable Scattered Linear Orderings

In a preceding paper (Bruyère and Carton, automata on linear orderings, MFCS’01), automata have been introduced for words indexed by linear orderings. These automata are a generalization of automata for finite, infinite, bi-infinite and even transfinite words studied by Büchi. Kleene’s theorem has been generalized to these words. We prove that rational sets of words on countable scattered linea...

متن کامل

Logic and Bounded-Width Rational Languages of Posets over Countable Scattered Linear Orderings

In this paper we consider languages of labelled N -free posets over countable and scattered linear orderings. We prove that a language of such posets is series-rational if and only if it is recognizable by a finite depth-nilpotent algebra if and only if it is bounded-width and monadic second-order definable. This extends previous results on languages of labelled N -free finite and ω-posets and ...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

عنوان ژورنال:

دوره   شماره 

صفحات  -

تاریخ انتشار 2006